package tx.algoritmiek.week2;

public class Main {

    /**
     * @param args
     */
    public static void main(String[] args) {
    	
//        GameObject[] gameObjects = new GameObject[8];
//        gameObjects[0] = new GameObject(900, 100);
//        gameObjects[1] = new GameObject(100, 100);
//        gameObjects[2] = new GameObject(950, 50);
//        gameObjects[3] = new GameObject(50, 750);
//        gameObjects[4] = new GameObject(110, 90);
//        gameObjects[5] = new GameObject(60, 800);
//        gameObjects[6] = new GameObject(40, 800);
//        gameObjects[7] = new GameObject(700, 850);
//        
//        BinaryTree tree = new BinaryTree(new QuickSortAlgorithm().sortGameObjects(gameObjects));
//        tree.setBoundArraysInTree();
//        int[] coordinates = {500, 100};
//        tree.find(coordinates);
    	BinaryTreeBenchmark benchmark = new BinaryTreeBenchmark(5000);
    	benchmark.benchmarkCustomBinaryTree();
    	benchmark.benchmarkArray();
    }

}
